AN EXTENDED COST ALLOCATION METHOD FOR MULTI-PURPOSE RESERVOIR DEVELOPMENTS WITH SPILLOVER FROM COALITION FORMATION CONSIDERED
نویسندگان
چکیده
منابع مشابه
Layering Coalition Formation With Task Allocation
This paper presents an approach for layering lower-level coalition formation with higher-level, traditional task allocation. At the lower level, coalitions to solve multi-robot tasks are formed using our ASyMTRe approach that maps environmental sensors and perceptual and motor schemas to the required flow of information in the robot team, automatically reconfiguring the connections of schemas w...
متن کاملExtended Ritz method for reservoir management over an infinite horizon
The management problem of water reservoirs can be formulated as a stochastic optimal control (SOC) problem, where the objective function is an aggregated cost that accounts for the interests acting in the water system (e.g. hydropower production, irrigation supply, etc.) and the design variable is the reservoirs release policy. Solving the SOC problem through stochastic dynamic programming is o...
متن کاملA Framework for Multi-Robot Coalition Formation
Task allocation is a fundamental problem that any multirobot system must address. Numerous multi-robot task allocation schemes have been proposed over the past decade. A vast majority of these schemes address the problem of assigning a single robot to each task. However as the complexity of multi-robot tasks increases, often situations arise where multiple robot teams need to be assigned to a s...
متن کاملMulti-criteria Coalition Formation Games
When forming coalitions, agents have different utilities per coalition. Game-theoretic approaches typically assume that the scalar utility for each agent for each coalition is public information. However, we argue that this is not a realistic assumption, as agents may not want to divulge this information or are even incapable of expressing it. To mitigate this, we propose the multi-criteria coa...
متن کاملParallel multi-objective multi-robot coalition formation
Consider a system with M robots each having K resource types and N tasks having a vector of Kresource types. A coalition scheme represents a grouping of a given set of robots into disjoint subsets where each subset (coalition ) is assigned one task. Thus for N tasks we have N coalition schemes, represented as CS = {C1, C2,,....CN}, In this problem we have considered the following two conflictin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Doboku Gakkai Ronbunshu
سال: 1999
ISSN: 0289-7806,1882-7187
DOI: 10.2208/jscej.1999.625_181